Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times
نویسندگان
چکیده
منابع مشابه
Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times
We consider two single-machine group scheduling problems with deteriorating group setup and job processing times. That is, the job processing times and group setup times are linearly increasing or decreasing functions of their starting times. Jobs in each group have the same deteriorating rate. The objective of scheduling problems is to minimize the sum of completion times. We show that the sum...
متن کاملPrecedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine
We consider the problem of scheduling a set of jobs on a single machine with the objective of minimizing sum of weighted completion times. The problem is NP-hard when there are precedence constraints between jobs 15]. We provide an eecient com-binatorial 2-approximation algorithm for this problem. In contrast to our work, earlier approximation algorithms 12] achieving constant factor approximat...
متن کاملParallel Machine Scheduling to Minimize the Sum of Quadratic Completion Times
We consider the parallel machine scheduling problem of minimizing the sum of quadratic job completion times. We first prove that the problem is strongly NP-hard. We then demonstrate by probabilistic analysis that the shortest processing time rule solves the problem asymptotically. The relative error of the rule converges in probability to zero under the assumption that the job processing times ...
متن کاملSingle-machine group scheduling problems with deterioration consideration
In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job deterioration is relatively unexplored in the context of group technology. In this paper, we consider deterioration in the framework ofminimizing themakespan and the total completion time in single-machine group sched...
متن کاملSingle machine scheduling problem with interval processing times to minimize mean weighted completion time
The single resource scheduling problem is commonly applicable in practice not only when there is a single resource but also in some multiple-resource production systems where only one of the resources is bottle neck. Thus, the single resource (machine) scheduling problem has been widely addressed in the scheduling literature. In this paper, the single machine scheduling problem with uncertain a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2012
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2012/275239